Sparse Grid Approximation in Weighted Wiener Spaces
نویسندگان
چکیده
Abstract We study approximation properties of multivariate periodic functions from weighted Wiener spaces by sparse grid methods constructed with the help quasi-interpolation operators. The class such operators includes classical interpolation and sampling operators, Kantorovich-type scaling expansions associated wavelet constructions, others. obtain rate convergence corresponding in norms as well analogues Littlewood–Paley-type characterizations terms families
منابع مشابه
Optimized general sparse grid approximation spaces for operator equations
This paper is concerned with the construction of optimized sparse grid approximation spaces for elliptic pseudodifferential operators of arbitrary order. Based on the framework of tensor-product biorthogonal wavelet bases and stable subspace splittings, we construct operator-adapted subspaces with a dimension smaller than that of the standard full grid spaces but which have the same approximati...
متن کاملApproximation in Weighted L Spaces
The Lipschitz classes Lip (α, p, w) , 0 < α ≤ 1 are defined for the weighted Lebesgue spaces L p w with Muckenhoupt weights, and the degree of approximation by matrix transforms of f ∈ Lip (α, p, w) is estimated by n −α .
متن کاملMinimality, (weighted) Interpolation in Paley-wiener Spaces & Control Theory
Abstract. It is well known from a result by Shapiro-Shields that in the Hardy spaces, a sequence of reproducing kernels is uniformly minimal if and only if it is an unconditional basis in its span. This property which can be reformulated in terms of interpolation and so-called weak interpolation is not true in Paley-Wiener spaces in general. Here we show that the Carleson condition on a sequenc...
متن کاملIterative Hard Thresholding for Weighted Sparse Approximation
Recent work by Rauhut and Ward developed a notion of weighted sparsity and a corresponding notion of Restricted Isometry Property for the space of weighted sparse signals. Using these notions, we pose a best weighted sparse approximation problem, i.e. we seek structured sparse solutions to underdetermined systems of linear equations. Many computationally efficient greedy algorithms have been de...
متن کاملThe sample complexity of weighted sparse approximation
For Gaussian sampling matrices, we provide bounds on the minimal number of measurements m required to achieve robust weighted sparse recovery guarantees in terms of how well a given prior model for the sparsity support aligns with the true underlying support. Our main contribution is that for a sparse vector x ∈ R supported on an unknown set S ⊂ {1, 2, . . . , N} with |S| ≤ k, if S has weighted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fourier Analysis and Applications
سال: 2023
ISSN: ['1531-5851', '1069-5869']
DOI: https://doi.org/10.1007/s00041-023-09994-2